Boolean Neural Networks

نویسندگان

  • ROMAN KOHUT
  • BERND STEINBACH
چکیده

In this paper, we present a new type of neuron, called Boolean neuron. Further, we suggest the general structure of a neural network that includes only Boolean neurons and may realize several sets of Boolean functions. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean neural network may be mapped to a FPGA so that our new training algorithms substitute classical design methods of these circuits. In the example, we show the decomposition of a set of Boolean functions into common basic functions and their mapping to the general Boolean neural network. Key-Words: Boolean neuron, BNN, data representation, FTFS, functions set

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposition of Boolean Function Sets for Boolean Neural Networks

This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean n...

متن کامل

Neural Networks – A Model of Boolean Functions

This paper deals with the representation of Boolean functions using artificial neural networks and points out three important results. First, using a polynomial as transfer function, a single neuron is able to represent a non-monotonous Boolean function. Second, the number of inputs in the neural network can be decreased if the binary values of the Boolean variables are encoded. This approach s...

متن کامل

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of ω-automata, and then t...

متن کامل

Connections between Neural Networks and Boolean Functions∗

This report surveys some connections between Boolean functions and artificial neural networks. The focus is on cases in which the individual neurons are linear threshold neurons, sigmoid neurons, polynomial threshold neurons, or spiking neurons. We explore the relationships between types of artificial neural network and classes of Boolean function. In particular, we investigate the type of Bool...

متن کامل

A Boolean Algebra Based Rule Extraction Algorithm for Neural Networks with Binary or Bipolar Inputs

Neural networks have been applied in various domain including science, commerce, medicine, and industry. However, The knowledge learned by a trained neural network is difficult to understand. This paper proposes a Boolean algebra based algorithm to extract comprehensible Boolean rules from supervised feed-forward neural networks to uncover the black-boxed knowledge. This algorithm is called the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004